نتایج جستجو برای: Chance con-strained programming

تعداد نتایج: 484532  

Journal: :iranian journal of fuzzy systems 2011
xiaohu yang

convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

Journal: :Math. Program. 2000
Darinka Dentcheva András Prékopa Andrzej Ruszczynski

We consider stochastic programming problems with probabilistic con straints involving integer valued random variables The concept of a p e cient point of a probability distribution is used to derive various equivalent problem formula tions Next we introduce the concept of r concave discrete probability distributions and analyse its relevance for problems under consideration These notions are us...

Journal: :Math. Program. 2017
Shabbir Ahmed James R. Luedtke Yongjia Song Weijun Xie

We propose two new Lagrangian dual problems for chance-con-strained stochastic programs based on relaxing nonanticipativity constraints. We compare the strength of the proposed dual bounds and demonstrate that they are superior to the bound obtained from the continuous relaxation of a standard mixed-integer programming (MIP) formulation. For a given dual solution, the associated Lagrangian rela...

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran

abstract it is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (cc) problem. for this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. a samp...

Journal: :journal of industrial engineering, international 2011
s. amir abrishamifar

determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. one of the important operational con...

Abstract It is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (CC) problem. For this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. A sam...

Journal: :iranian journal of fuzzy systems 2011
saeed ramezanzadeh aghileh heydari

in this paper, a model of an optimal control problem with chance constraints is introduced. the parametersof the constraints are fuzzy, random or fuzzy random variables. todefuzzify the constraints, we consider possibility levels.  bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

Journal: :Journal of the Operations Research Society of Japan 1978

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید